Creating Reader‐Friendly Lists

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Creating False Memories: Remembering Words Not Presented in Lists

Two experiments (modeled after J. Deese's 1959 study) revealed remarkable levels of false recall and false recognition in a list learning paradigm. In Experiment 1, subjects studied lists of 12 words (e.g., bed, rest, awake); each list was composed of associates of 1 nonpresented word (e.g., sleep). On immediate free recall tests, the nonpresented associates were recalled 40% of the time and we...

متن کامل

Remembering words not presented in lists: Can we avoid creating false memories?

Can subjects avoid creating false memories as outlined in Roediger and McDermott's (1995) false recognition paradigm if they are forewarned about this memory illusion? We presented subjects with semantically related word lists, followed by a recognition test. The test was composed of studied words, semantically related nonstudied words (critical lures), and unrelated nonstudied words. One group...

متن کامل

Reading Lists

Babcock, L. & Laschever, S. (2003). Women don’t ask: Negotiation and the gender divide. Princeton, New Jersey: Princeton University Press. Women Don't Ask shows women how to reframe their interactions and more accurately evaluate their opportunities. The book includes examining how to ask for a desired outcome in ways that feel comfortable and possible, taking into account the impact of asking ...

متن کامل

A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists

We examine the problem of self-organizing linear search lists, which are lists that react to queries received from an environment by running a heuristic to reorganize the records in order to minimize the search cost. In particular, we are concerned with environments with the locality of reference phenomenon, when the queries exhibit a probabilistic dependence between themselves. We introduce a ...

متن کامل

Infinite Lists

We introduce a theory of infinite lists in HOL formalized as functions over naturals (folder ListInf, theories ListInf and ListInf Prefix). It also provides additional results for finite lists (theory ListInf/List2), natural numbers (folder CommonArith, esp. division/modulo, naturals with infinity), sets (folder CommonSet, esp. cutting/truncating sets, traversing sets of naturals).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nurse Author & Editor

سال: 2000

ISSN: 1750-4910,1750-4910

DOI: 10.1111/j.1750-4910.2000.tb00449.x